Transition matrix cluster algorithms

Sparse Matrix Reordering Algorithms for Cluster Identification

Transition Matrix

1 Ways to Describe a Stochastic Process We will use the biased coin example to illustrate three ways with which we can describe a stochastic process, a Markov Chain (MC) in particular. Probabilistic Random variable X represents the outcome of the experiment where we toss a specific coin once. There is 0.55 probability for the result to be heads (H) and 0.45 to be tails (T). X i = H with probabi...

The cluster vapor to cluster solid transition

Until now, depletion induced transitions have been the hallmark of multicomponent systems only. Monte Carlo simulations reveal a depletion-induced phase transition from cluster vapor to cluster solid in a one-component uid with competing short range and long range interactions. This con rms a prediction made by earlier theoretical work. Analysis of renormalized cluster-cluster and clustervapor ...

Fermion Cluster Algorithms

Cluster algorithms have been recently used to eliminate sign problems that plague Monte-Carlo methods in a variety of systems. In particular such algorithms can also be used to solve sign problems associated with the permutation of fermion world lines. This solution leads to the possibility of designing fermion cluster algorithms in certain cases. Using the example of free non-relativistic ferm...

Parallel Wolff Cluster Algorithms

The Wolff single-cluster algorithm is the most efficient method known for Monte Carlo simulation of many spin models. Due to the irregular size, shape and position of the Wolff clusters, this method does not easily lend itself to efficient parallel implementation, so that simulations using this method have thus far been confined to workstations and vector machines. Here we present two parallel ...